Minimum leaf out-branching and related problems
نویسندگان
چکیده
منابع مشابه
Minimum leaf out-branching and related problems
Given a digraph D, the Minimum Leaf Out-Branching problem (MinLOB) is the problem of finding in D an out-branching with the minimum possible number of leaves, i.e., vertices of out-degree 0. We prove that MinLOB is polynomial-time solvable for acyclic digraphs. In general, MinLOB is NPhard and we consider three parameterizations of MinLOB. We prove that two of them are NP-complete for every val...
متن کاملMinimum Leaf Out-Branching Problems
Given a digraph D, the Minimum Leaf Out-Branching problem (MinLOB) is the problem of finding in D an out-branching with the minimum possible number of leaves, i.e., vertices of out-degree 0. We prove that MinLOB is polynomial-time solvable for acyclic digraphs. In general, MinLOB is NP-hard and we consider three parameterizations of MinLOB. We prove that two of them are NP-complete for every va...
متن کاملParameterized Minimum Leaf Out-Branching Problems
Given a digraph D, the Minimum Leaf Out-Branching problem (MinLOB) is the problem of finding in D an out-branching with the minimum possible number of leaves, i.e., vertices of out-degree 0. We describe three parameterizations of MinLOB and prove that two of them are NP-complete for every value of the parameter, but the third one is fixed-parameter tractable (FPT). The FPT parametrization is as...
متن کاملOn Complexity of Minimum Leaf Out-branching Problem
Given a digraph D, the Minimum Leaf Out-Branching problem (MinLOB) is the problem of finding in D an out-branching with the minimum possible number of leaves, i.e., vertices of out-degree 0. Gutin, Razgon and Kim (2008) proved that MinLOB is polynomial time solvable for acyclic digraphs which are exactly the digraphs of directed path-width (DAG-width, directed tree-width, respectively) 0. We in...
متن کاملStochastic Minimum Spanning Trees and Related Problems
We investigate the computational complexity of minimum spanning trees and maximum flows in a simple model of stochastic networks, where each node or edge of an undirected master graph can fail with an independent and arbitrary probability. We show that computing the expected length of the MST or the value of the max-flow is #P -Hard, but that for the MST it can be approximated within O(log n) f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2009
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2009.03.036